翻訳と辞書 Words near each other ・ Hieronim Wincenty Radziwiłł ・ Hieronim Wołłowicz ・ Hieronim Zoch ・ Hieronimo ・ Hieronimo Custodis ・ Hieronimo Miani ・ Hieronimo Squarciafico ・ Hieronimowo ・ Hieronimów ・ Hieronyma ・ Hieronyma clusioides ・ Hieronyma crassistipula ・ Hieronyma jamaicensis ・ Hieronyma macrocarpa ・ Hieronymiella ・ Hierarchical closeness ・ Hierarchical Cluster Engine Project ・ Hierarchical clustering ・ Hierarchical clustering of networks ・ Hierarchical constraint satisfaction ・ Hierarchical control system ・ Hierarchical Data Format ・ Hierarchical database model ・ Hierarchical decision process ・ Hierarchical Dirichlet process ・ Hierarchical Editing Language for Macromolecules ・ Hierarchical epistemology ・ Hierarchical fair-service curve ・ Hierarchical File System ・ Hierarchical generalized linear model Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hierarchical closeness ： ウィキペディア英語版 Hierarchical closeness Hierarchical closeness (HC) is a structural centrality measure used in network theory or graph theory. It’s extended from closeness centrality to rank how centrally located a node is in a directed network. The original closeness considers the most important node in a directed network simply is the node where can reach to other nodes by the shortest paths whereas hierarchical closeness evaluates the most important node is the node where can reach the most of nodes by the shortest paths. The hierarchical closeness explicitly includes information about the range of other nodes that can be affected by the given node. In a directed network $G(V,\; A)$ where $V$ is the set of nodes and $A$ is the set of interactions, hierarchical closeness of a node $i$ ∈ $V$ called $C\_(i)$ was proposed by Tran and Kwon〔Tran, T.-D. and Kwon, Y.-K. Hierarchical closeness efficiently predicts disease genes in a directed signaling network, Computational biology and chemistry.〕 as follows: :$C\_(i)\; =\; N\_R(i)\; +\; C\_(i)$ where: * $N\_R(i)\; \backslash in\; (|V|\; -\; 1)$ is the reachability of a node $i$ defined by $N\_R(i)\; =\; |\backslash |$, and * $C\_(i)$ is the normalized form of original closeness (Sabidussi, 1966).〔Sabidussi, G. (1966) The centrality index of a graph, Psychometrika, 31, 581-603 %G English〕 It can use a variant definition of closeness〔Opsahl, T., Agneessens, F. and Skvoretz, J. (2010) Node centrality in weighted networks: Generalizing degree and shortest paths, Social networks, 32, 245-251.〕 as follows: $C\_(i)=\backslash frac\; \backslash sum\_$ where $d(i,\; j)$ is the distance of the shortest path, if any, from $i$ to $j$; otherwise, $d(i,\; j)$ is specified as an infinite value. In the formula, $N\_R(i)$ represents the number of nodes in $V$ that can be reachable from $i$. It can also represent the hierarchical position of a node in a directed network. It notes that if $N\_R(i)\; =\; 0$, then $C\_(i)\; =\; 0$ because $C\_(i)$ is $0$. In cases where $N\_R(i)\; >\; 0$, the reachability is a dominant factor because $N\_R(i)\; \backslash geq\; 1$ but . In other words, the first term indicates the level of the global hierarchy and the second term presents the level of the local centrality. == Application == Hierarchical closeness can be used in biological networks to rank the risk of genes to carry diseases.() 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hierarchical closeness」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.